Newton interpolation in Fejér and Chebyshev points
نویسندگان
چکیده
منابع مشابه
Newton Interpolation in Fejér and Chebyshev Points
Let T be a Jordan curve in the complex plane, and let Í) be the compact set bounded by T. Let / denote a function analytic on O. We consider the approximation of / on fî by a polynomial p of degree less than n that interpolates / in n points on T. A convenient way to compute such a polynomial is provided by the Newton interpolation formula. This formula allows the addition of one interpolation ...
متن کاملRational Interpolation at Chebyshev points
The Lanczos method and its variants can be used to solve eeciently the rational interpolation problem. In this paper we present a suitable fast modiication of a general look-ahed version of the Lanczos process in order to deal with polynomials expressed in the Chebyshev orthogonal basis. The proposed approach is particularly suited for rational interpolation at Chebyshev points, that is, at the...
متن کاملFast Evaluation and Interpolation at the Chebyshev Sets of Points
Stable polynomial evaluation and interpolation at n Chebyshev or adjusted (expanded) Chebyshev points is performed using O(nlog’ n) arithmetic operations, to be compared with customary algorithms either using on the order of n* operations or being unstable. We also evaluate a polynomial of degree d at the sets of n Chebyshev or adjusted (expanded) Chebyshev points using O(dlog d log n) if n 5 d...
متن کاملLagrange Interpolation on Chebyshev Points of Two Variables
We study interpolation polynomials based on the points in [−1, 1]× [−1, 1] that are common zeros of quasi-orthogonal Chebyshev polynomials and nodes of near minimal degree cubature formula. With the help of the cubature formula we establish the mean convergence of the interpolation polynomials. 1991 Mathematics Subject Classification: Primary 41A05, 33C50.
متن کاملFast and Stable Rational Interpolation in Roots of Unity and Chebyshev Points
A new method for interpolation by rational functions of prescribed numerator and denominator degrees is presented. When the interpolation nodes are roots of unity or Chebyshev points, the algorithm is particularly simple and relies on discrete Fourier transform matrices, which results in a fast implementation using the Fast Fourier Transform. The method is generalised for arbitrary grids, which...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1989
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1989-0969487-3